Reduct Generation in Information Systems

نویسندگان

  • G. Ganesan
  • D. Latha
  • C. Raghavendra Rao
چکیده

In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expansion on the data. However, implementation of this algorithm is cumbersome for huge volume of data. This paper deals with a technique for obtaining the reduct of the entire system by partitioning it into two with respect to records and obtaining the reducts of the two subsystems and the ‘between reducts’. Further, it also deals with a technique for combining the reducts computed at the clients to obtain global reducts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Rough Set Approach for Generation and Validation of Rules for Missing Attribute

Data mining has emerged as most significant and continuously evolving field of research because of it‘s ever growing and far reaching applications into various areas such as medical, military, financial markets, banking etc. One of the most useful applications of data mining is extracting significant and earlier unknown knowledge from real-world databases. This knowledge may be in the form of r...

متن کامل

Attribute Reduction and Information Granularity

This work was supported by Science and Technology Commission of Shanghai Municipality, No.705931 ABSTRACT In the view of granularity, this paper analyzes the influence of three attribute reducts on an information system, finding that the possible reduct and − μ decision reduct will make the granule view coarser, while discernible reduct will not change the granule view. In addition, we investig...

متن کامل

Attribute Reduction using Forward Selection and Relative Reduct Algorithm

Attribute reduction of an information system is a key problem in rough set theory and its applications. Rough set theory has been one of the most successful methods used for feature selection. Rough set is one of the most useful data mining techniques. This paper proposes relative reduct to solve the attribute reduction problem in roughest theory. It is the most promising technique in the Rough...

متن کامل

Compositional Specification Calculus for Information Systems Development

The paper presents a novel approach for type speciication manipulations as the basic operations intended to develop various forms of compositions in information systems. Among them are interoperable compositions of pre-existing components formed during the information systems design, heterogeneous multidatabase compositions, database sche-ma and ontology integration, compositions of workkows, c...

متن کامل

Approach to approximate distribution reduct in incomplete ordered decision system

The original rough set model cannot be used to deal with the incomplete information systems. Nevertheless, by relaxing the indiscernibility relation to more general binary relations, many improved rough set models have been successfully applied into the incomplete information systems for knowledge acquisition. This article presents an explorative research focusing on the transition from incompl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Engineering Letters

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2007